Convolution-multiplication identities for Tutte polynomials of matroids
نویسنده
چکیده
Abstract. We give a general multiplication-convolution identity for the multivariate and bivariate rank generating polynomial of a matroid. The bivariate rank generating polynomial is transformable to and from the Tutte polynomial by simple algebraic operations. Several identities, almost all already known in some form, are specialization of this identity. Combinatorial or probabilistic interpretations are given for the specialized identities. Subject classification number. 05B35 05C15 05C80
منابع مشابه
Tutte Polynomials of Generalized Parallel Connections
We use weighted characteristic polynomials to compute Tutte polynomials of generalized parallel connections in the case in which the simplification of the maximal common restriction of the two constituent matroids is a modular flat of the simplifications of both matroids. In particular, this includes cycle matroids of graphs that are identified along complete subgraphs. We also develop formulas...
متن کاملAn Introduction to Transversal Matroids
1. Prefatory Remarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 2. Several Perspectives on Transversal Matroids . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.1. Set systems, transversals, partial transversals, and Hall’s theorem . . . . . . . . 2 2.2. Transversal matroids via matrix encodings of set systems . . . . . ....
متن کاملLatroids and Their Representation by Codes over Modules
It has been known for some time that there is a connection between linear codes over fields and matroids represented over fields. In fact a generator matrix for a linear code over a field is also a representation of a matroid over that field. There are intimately related operations of deletion, contraction, minors and duality on both the code and the matroid. The weight enumerator of the code i...
متن کاملLattice path matroids: enumerative aspects and Tutte polynomials
Fix two lattice paths P and Q from ð0; 0Þ to ðm; rÞ that use East and North steps with P never going above Q: We show that the lattice paths that go from ð0; 0Þ to ðm; rÞ and that remain in the region bounded by P and Q can be identified with the bases of a particular type of transversal matroid, which we call a lattice path matroid. We consider a variety of enumerative aspects of these matroid...
متن کاملMöbius conjugation and convolution formulae
Let P be a locally finite poset with the interval space Int(P ), and R a ring with identity. We shall introduce the Möbius conjugation μ∗ sending each function f : P → R to an incidence function μ∗(f) : Int(P ) → R such that μ∗(fg) = μ∗(f) ∗μ∗(g). Taking P to be the intersection poset of a hyperplane arrangement A, we shall obtain a convolution identity for the number r(A) of regions and the nu...
متن کامل